-
1 интерполяционный многочлен Ньютона
Newton interpolation polynomial пример из статьи шведского автора (напечатано в Нью-Йорке)Now the Newton interpolation polynomial of degree k can be written - теперь можно записать интерполяционный многочлен Ньютона степени k
Русско-английский словарь по численным методам интегрирования жёстких систем обыкновенных дифференциальных уравнений > интерполяционный многочлен Ньютона
-
2 многочлен
a polynomial многочлен степени k - a polynomial of degree k пример из статьи шведского автора (напечатано в Нью-Йорке)Now the Newton interpolation polynomial of degree k can be written - теперь можно записать интерполяционный многочлен Ньютона степени k
Русско-английский словарь по численным методам интегрирования жёстких систем обыкновенных дифференциальных уравнений > многочлен
См. также в других словарях:
Newton polynomial — In the mathematical field of numerical analysis, a Newton polynomial, named after its inventor Isaac Newton, is the interpolation polynomial for a given set of data points in the Newton form. The Newton polynomial is sometimes called Newton s… … Wikipedia
Polynomial interpolation — In the mathematical subfield of numerical analysis, polynomial interpolation is the interpolation of a given data set by a polynomial. In other words, given some data points (such as obtained by sampling), the aim is to find a polynomial which… … Wikipedia
Newton–Cotes formulas — In numerical analysis, the Newton–Cotes formulae, also called the Newton–Cotes quadrature rules or simply Newton–Cotes rules, are a group of formulae for numerical integration (also called quadrature) based on evaluating the integrand at equally… … Wikipedia
interpolation — /in terr peuh lay sheuhn/, n. 1. the act or process of interpolating or the state of being interpolated. 2. something interpolated, as a passage introduced into a text. 3. Math. a. the process of determining the value of a function between two… … Universalium
Newton's method — In numerical analysis, Newton s method (also known as the Newton–Raphson method), named after Isaac Newton and Joseph Raphson, is a method for finding successively better approximations to the roots (or zeroes) of a real valued function. The… … Wikipedia
Lagrange polynomial — In numerical analysis, a Lagrange polynomial, named after Joseph Louis Lagrange, is the interpolation polynomial for a given set of data points in the Lagrange form. It was first discovered by Edward Waring in 1779 and later rediscovered by… … Wikipedia
Hermite interpolation — is a method closely related to the Newton divided difference method of interpolation in numerical analysis, that allows us to consider given derivatives at data points, as well as the data points themselves. The interpolation will give a… … Wikipedia
Gauss–Newton algorithm — The Gauss–Newton algorithm is a method used to solve non linear least squares problems. It can be seen as a modification of Newton s method for finding a minimum of a function. Unlike Newton s method, the Gauss–Newton algorithm can only be used… … Wikipedia
Characteristic polynomial — This article is about the characteristic polynomial of a matrix. For the characteristic polynomial of a matroid, see Matroid. For that of a graded poset, see Graded poset. In linear algebra, one associates a polynomial to every square matrix: its … Wikipedia
List of polynomial topics — This is a list of polynomial topics, by Wikipedia page. See also trigonometric polynomial, list of algebraic geometry topics.Basics*Polynomial *Coefficient *Monomial *Polynomial long division *Polynomial factorization *Rational function *Partial… … Wikipedia
Bernstein polynomial — In the mathematical field of numerical analysis, a Bernstein polynomial, named after Sergei Natanovich Bernstein, is a polynomial in the Bernstein form, that is a linear combination of Bernstein basis polynomials.A numerically stable way to… … Wikipedia
